Photometry Data Coding for Three-Dimensional Mesh Models Using Connectivity and Geometry Information

نویسندگان

  • Young-Suk Yoon
  • Sung-Yeol Kim
  • Yo-Sung Ho
چکیده

In this paper, we propose new predictive coding schemes for photometry data of three-dimensional (3-D) mesh models as per-vertex binding. We exploit geometry and connectivity information to enhance coding efficiency of the color and normal vector data. For color coding, we predict the color of the current vertex by a weighted sum of colors of adjacent vertices considering angles between the current vertex and the adjacent vertices. For normal vector coding, we generate an optimal plane using distance equalization to predict the normal vector of the current vertex. Experimental results show that the proposed coding schemes provide improved coding performance over previous works for various 3-D mesh models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new conforming mesh generator for three-dimensional discrete fracture networks

Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...

متن کامل

Progressive mesh compression using cosine index predictor and 2-stage geometry predictor

In this paper, we propose a progressive compression algorithm for three-dimensional (3-D) mesh data, which can efficiently encode the connectivity and geometry information. Using cosine index predictor and vertex confinement rule, the proposed scheme encodes the connectivity information compactly. For the geometry information coding, a 2-stage geometry predictor is proposed to reduce the predic...

متن کامل

Spectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph

In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the mesh topology. After we partition a 3-D mesh model into several independent submeshes to reduce coding complexity, each submesh geometry is projected ...

متن کامل

Quadtree and Octree Grid Generation

Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...

متن کامل

Optimized Compression of Triangle Mesh Geometry Using Prediction Trees

Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to the vertex sequence as dictated by the connectivity code. This generates a suboptimal geometry code, which results in significant loss in code efficiency, since the geometry dominates the mesh information content. This...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005